Isotropic N-point basis functions and their properties
نویسندگان
چکیده
Abstract Isotropic functions of positions r 1 , 2 … N , i.e. invariant under simultaneous rotations all the coordinates, are conveniently formed using spherical harmonics and Clebsch–Gordan coefficients. An orthonormal basis such provides a formalism suitable for analyzing isotropic distributions as those that arise in cosmology, instance clustering galaxies revealed by large-scale structure surveys. The algebraic properties expressed terms 6- j 9- symbols. calculation relations among is facilitated ‘Yutsis’ diagrams addition recoupling angular momenta.
منابع مشابه
Differentiability Properties of Isotropic Functions
1. Introduction. Let Sym denote the linear space of all symmetric second-order tensors on an n-dimensional real vector space Vect with scalar product. (If Vect is identified with R n , then Sym may be identified with the set of all symmetric n-by-n matrices.) A function f : Sym → R is said to be isotropic if f (A) = f (QAQ T) for all A ∈ Sym and all Q proper orthogonals. An isotropic function h...
متن کاملarchitecture and engineering of nanoscale sculptured thin films and determination of their properties
چکیده ندارد.
15 صفحه اولIsotropic covariance functions on spheres: Some properties and modeling considerations
Introducing flexible covariance functions is critical for interpolating spatial data since the properties of interpolated surfaces depend on the covariance function used for Kriging. An extensive literature is devoted to covariance functions on Euclidean spaces, where the Matérn covariance family is a valid and flexible parametric family capable of controlling the smoothness of corresponding st...
متن کاملDistributed Point Functions and Their Applications
For x, y ∈ {0, 1}∗, the point function Px,y is defined by Px,y(x) = y and Px,y(x) = 0|y| for all x′ 6= x. We introduce the notion of a distributed point function (DPF), which is a keyed function family Fk with the following property. Given x, y specifying a point function, one can efficiently generate a key pair (k0, k1) such that: (1) Fk0 ⊕ Fk1 = Px,y , and (2) each of k0 and k1 hides x and y....
متن کاملFast n-point correlation functions and three-point lensing application
We present a new algorithm to rapidly compute the two-point (2PCF), three-point (3PCF) and n-point (n-PCF) correlation functions in roughly O(N) time for N particles, instead of O(Nn) as required by brute force approaches. This technique exploits node-to-node correlations of a recursive bisectional binary tree. A balanced tree construction minimizes the depth of the tree and the worst case erro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A
سال: 2023
ISSN: ['1751-8113', '1751-8121']
DOI: https://doi.org/10.1088/1751-8121/acdfc4